Reaching Envy-Free States in Distributed Negotiation Settings
نویسندگان
چکیده
• Set of agents A = {1..n} and set of indivisible resources R. • An allocation A is a partitioning of R amongst the agents. Example: A(i) = {r5, r7} — agent i owns resources r5 and r7 • Each agent i ∈ A has got a valuation function vi : 2R → R. Example: vi(A) = vi(A(i)) = 577.8 — agent i is pretty happy • Agents may engage in negotiation to exchange resources in order to benefit either themselves or society as a whole.
منابع مشابه
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A group of agents may only contract a deal if that group is fully connected according to the negotiation topology. An important criterion for assessing the quality of an allocation of resources, in terms of fairness, is env...
متن کاملEnvy-free Matchings with Lower Quotas
While every instance of the Hospitals/Residents problem admits a stable matching, the problem with lower quotas (HR-LQ) has instances with no stable matching. For such an instance, we expect the existence of an envy-free matching, which is a relaxation of a stable matching preserving a kind of fairness property. In this paper, we investigate the existence of an envy-free matching in several set...
متن کاملDistributed fair allocation of indivisible goods
Distributed mechanisms for allocating indivisible goods are mechanisms lacking central control, in which agents can locally agree on deals to exchange some of the goods in their possession. We study convergence properties for such distributed mechanisms when used as fair division procedures. Specifically, we identify sets of assumptions under which any sequence of deals meeting certain conditio...
متن کاملNegotiations Over Time in a Multi-Agent Environment: Preliminary Report
One of the major foci of research in distributed artificial intelligence (DAI) is the design of automated agents which can interact effectively in order to cooperate in problem-solving. Negotiation is recognized as an important means by which inter-agent cooperation is achieved. In this paper we suggest a strategic model of negotiation for N agents (N > 3), that takes the passage of time during...
متن کاملRevenue Maximizing Envy-Free Pricing in Matching Markets with Budgets
We study envy-free pricing mechanisms in matching markets with m items and n budget constrained buyers. Each buyer is interested in a subset of the items on sale, and she appraises at some single-value every item in her preference-set. Moreover, each buyer has a budget that constraints the maximum affordable payment, while she aims to obtain as many items as possible of her preference-set. Our ...
متن کامل